Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
881	Words of Wisdom: The Paradox of Our Times Add to Reading List Source URL: www.scborromeo.org Language: English - Date: 2013-02-03 02:46:18 Computational complexity theory Reduction Structural complexity theory
882	Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel1 Cedric Chauve2 Dominique Rossin1 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-24 09:20:20 Computational complexity theory Abstract algebra Permutation Best worst and average case Sorting Sorting algorithms Mathematics Combinatorics
883	Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@ Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2006-01-18 12:07:28 Theoretical computer science Operations research Algorithm Mathematical logic Genetic algorithm Computational complexity theory Online algorithm Travelling salesman problem Ant colony optimization algorithms Mathematics Applied mathematics Mathematical optimization
884	LNCSComputational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 21:56:56 Models of computation Computability theory Turing machine Probabilistic complexity theory Probabilistic Turing machine Computational complexity theory Randomized algorithm Algorithm NP Theoretical computer science Applied mathematics Computer science
885	ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS STASYS JUKNA Abstract. We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2009-01-13 11:44:18 Information theory Randomness Philosophy of thermal and statistical physics Quantum information science Entropy Circuit Boolean circuit Fourier transform Communication complexity Theoretical computer science Applied mathematics Computational complexity theory
886	This article was downloaded by: [Chinese University of Hong Kong] On: 08 April 2013, At: 23:00 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: [removed]Registered office: Mortimer House Add to Reading List Source URL: mentalmodels.princeton.edu Language: English - Date: 2013-04-09 12:52:39 Mathematical logic Boolean circuit Computational complexity theory Logic in computer science Boolean algebra Switch Railroad switch Reverse engineering Nonblocking minimal spanning switch Algebraic logic Theoretical computer science Mathematics
887	Jack H. Lutz - Short CV Current position: Professor of Computer Science, Iowa State University (Assistant Professor; Associate Professor; Professor 1996-present) Professor of Mathematics Faculty Membe Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2015-04-12 22:23:22 Computer science Computability in Europe Algorithmic information theory Randomness Mathematical logic Computability Algorithm Computational complexity theory DNA computing Theoretical computer science Applied mathematics Mathematics
888	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
889	The Ackermann Award 2005 Erich Gr¨ adel, Janos Makowsky, and Alexander Razborov Members of EACSL Jury for the Ackermann Award The Ackermann Award Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:16 Automated theorem proving Computability theory Theory of computation Computational complexity theory Logic in computer science Alexander Razborov Wilhelm Ackermann Decidability First-order logic Theoretical computer science Mathematics Logic
890	The time scale of articial intelligence: Re ections on social eects Ray J. Solomono Visiting Professor, Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Add to Reading List Source URL: world.std.com Language: English - Date: 2014-09-18 21:18:33 Ethology Artificial intelligence Open problems Philosophy of mind Strong AI Mind Computational complexity theory Computer science Algorithm Science Computational neuroscience Philosophy of artificial intelligence

UPDATE